The finiteness of finitely presented monoids
نویسندگان
چکیده
منابع مشابه
The Finiteness of Finitely Presented Monoids
Introduction. It is undecidable whether a monoid given by a nite presentation is nite (see, e.g., [1], pp. 157{160). On the other hand, with the mere knowledge that the monoid is nite, one can e ectively construct the multiplication table of the monoid, and thus obtain a complete understanding of its structure. This paper will present this construction method in detail (Section 2) and o er some...
متن کاملOn Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids
An example of a nitely presented monoid is given that does not satisfy the homo-topical niteness condition FHT, although it satisses both the homological niteness conditions left FP 1 and right FP 1 .tions left FP 1 and right FP 1 .
متن کاملOn Dehn Functions of Finitely Presented Bi-Automatic Monoids
For each automatic monoid the word problem can be solved in quadratic time (Campbell et al 1996), and hence, the Dehn function of a nitely presented automatic monoid is recursive. Here we show that this result on the Dehn function cannot be improved in general by presenting nitely presented bi-automatic monoids the Dehn functions of which realize arbitrary complexity classes that are suuciently...
متن کاملA Countable Family of Finitely Presented Infinite Congruence-free Monoids
We prove that monoids Mon〈a, b, c, d : ab = 0, ac = 1, db = 1, dc = 1 dab = 1, dab = 1, . . . , dab = 1〉 are congruence-free for all n ≥ 1. This provides a new countable family of finitely presented congruence-free monoids, bringing one step closer to understanding the Boone–Higman Conjecture. We also provide examples which show that finitely presented congruence-free monoids may have quadratic...
متن کاملDecidability and Independence of Conjugacy Problems in Finitely Presented Monoids
There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by ∼p, ∼o, and ∼c) in certain classes of finitely presented monoids. We will show that in the class of polycyclic monoids, p-conjugacy is “almost” transitive, ∼c is stric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00038-3